Generalized Quantifiers in Dependence Logic
نویسنده
چکیده
We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics using the Hodges semantics, e.g., IF-logic and dependence logic. For this we introduce the multivalued dependence atom and observe the similarities with the, by Väänänen and Grädel, newly introduced independence atom.
منابع مشابه
A Double Team Semantics for Generalized Quantifiers
We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We als...
متن کاملCharacterizing quantifier extensions of dependence logic
We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.
متن کاملDependence Logic with Generalized Quantifiers: Axiomatizations
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result considers the extension of dependence logic where Q is interpreted as “there exists uncountable many.” Both of the axiomatizations are shown to be sound and com...
متن کاملModal Ontology and Generalized Quantifiers
Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distin...
متن کاملHenkin and Function Quantifiers
Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Logic, Language and Information
دوره 21 شماره
صفحات -
تاریخ انتشار 2012